Modified Minimum Spanning Tree for Optimised DC Microgrid Cabling Design

نویسندگان

چکیده

The construction of low-cost nanogrids could help speed up the electrification rate in remote communities sub-Saharan Africa. One challenges nanogrid design for these is uncertainty future load demand profiles impacting cabling topology. We propose two new wiring approaches radial direct current power distribution systems. first one a modified minimum spanning tree (MST) algorithm and second an adaptive shuffled frog leaping (SFLA). Their objective to identify optimal cable path lowest cost characteristics electrify rural areas with poor infrastructural development. A comparative study computation burdens has shown applicability limits relative SFLA based approach encouraged implementation MST as it faster does not imply any limitation regarding number dwellings electrify, while providing option. latter applied village located Kenya demonstrated more than 25% savings on entire system compared classical shortest-path calculation.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

4 Minimum Spanning Tree

This first algorithm is quite simple. (Though this was probably known earlier, its proof can be found in Prof. Indyk’s 1999 paper “Sublinear Time Algorithms for Metric Space Problems”.) Let Dij denote the distance between a pair of points i and j, over m total points. The entries of Dij must satisfy the triangle inequality; additionally the matrix is symmetric. Note that the matrix size (i.e., ...

متن کامل

A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem

The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...

متن کامل

Parallel Minimum Spanning Tree Algorithm

The Minimal Spanning Tree (MST) problem is a classical graph problem which has many applications in various areas. In this paper we discuss a concurrent MST algorithm derived from Prim’s algorithm presented by Setia et al. in 2009, targeting symmetric multiprocessing (SMP) with a shared address space. The pseudocode of the algorithm is presented, combined with three interesting heuristics in or...

متن کامل

Active Node Detection in A Reconfigurable Microgrid Using Minimum Spanning Tree Algorithms

Microgrids are the solution to the growing demand for energy in the recent times. It has the potential to improve local reliability, reduce cost and increase penetration rates for distributed renewable energy generation. Inclusion of Renewable Energy Systems(RES) which have become the topic of discussion in the recent times due to acute energy crisis, causes the power flow in the microgrid to b...

متن کامل

The Design of the Minimum Spanning Tree Algorithms

Based on the graphic theory and improved genetic algorithm, an improved genetic algorithm to search the minimum spanning trees is given. The algorithm uses binary code to represent the problem of minimum spanning trees. It designs the corresponding fitness function, operator and few controlling strategies to improve its speed and evolutionary efficiency. Only one solution can be gotten with run...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Smart Grid

سال: 2022

ISSN: ['1949-3053', '1949-3061']

DOI: https://doi.org/10.1109/tsg.2022.3164258